Ela the A-like Matrices for a Hypercube

نویسندگان

  • ŠTEFKO MIKLAVIČ
  • PAUL TERWILLIGER
  • Bryan L. Shader
چکیده

Let D denote a positive integer and let QD denote the graph of the D-dimensional hypercube. Let X denote the vertex set of QD and let A ∈ MatX(R) denote the adjacency matrix of QD. A matrix B ∈ MatX(R) is called A-like whenever both (i) BA = AB; (ii) for all x, y ∈ X that are not equal or adjacent, the (x, y)-entry of B is zero. Let L denote the subspace of MatX(R) consisting of the A-like elements. The subspace L is decomposed into the direct sum of its symmetric part and antisymmetric part. A basis for each part is given. The dimensions of the symmetric part and antisymmetric part are D + 1 and ( D 2 )

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A New Parallel Matrix Multiplication Method Adapted on Fibonacci Hypercube Structure

The objective of this study was to develop a new optimal parallel algorithm for matrix multiplication which could run on a Fibonacci Hypercube structure. Most of the popular algorithms for parallel matrix multiplication can not run on Fibonacci Hypercube structure, therefore giving a method that can be run on all structures especially Fibonacci Hypercube structure is necessary for parallel matr...

متن کامل

Ela Positive Semidefinite Maximum Nullity and Zero Forcing Number

The zero forcing number Z(G) is used to study the minimum rank/maximum nullity of the family of symmetric matrices described by a simple, undirected graph G. The positive semidefinite zero forcing number is a variant of the (standard) zero forcing number, which uses the same definition except with a different color-change rule. The positive semidefinite maximum nullity and zero forcing number f...

متن کامل

Two algorithms for the numerical factorization of large symmetric positive definite matrices for a hypercube multi- processor

This paper present two algorithms for the numerical factorization of large matrices. The matrices are assumed to be symmetrical positive definite which are typical matrices evolving from finite element method problems. The algorithms are designed to run on a hypercube multiprocessor.

متن کامل

Developing a conceptual model based upon the Latin Hypercube Sampling for integrating OHS into project risk evaluation

Abstract Project management in construction industry, in many cases, is imperfect with respect to the integration of Occupational Health and Safety (OHS) risks. This imperfection exhibits itself as complications affecting the riskiness of industrial procedures and is illustrated usually by poor awareness of OHS within project teams. Difficulties on OHS regularly came about in the construction i...

متن کامل

Ela Additive Rank–one Nonincreasing Maps on Hermitian Matrices over the Field

A complete classification of additive rank–one nonincreasing maps on hermitian matrices over Galois field GF (22) is obtained. This field is special and was not covered in a previous paper. As a consequence, some known applications, like the classification of additive rank–additivity preserving maps, are extended to arbitrary fields. An application concerning the preservers of hermitian varieti...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011